Two secure non-symmetric role Key-Agreement protocols

Recently, some two-party Authenticated Key Agreement protocols over elliptic curve based algebraic groups, in the context of Identity-Based cryptography have been proposed. The main contribution of this category of protocols is to reduce the complexity of performing algebraic operations through eliminating the need to using Bilinear Pairings. In this paper, we proposed two novel Identity-Based Authenticated Key Agreement protocols over non-symmetric role participants without using Bilinear Pairings. The results show that our proposed schemes beside of supporting security requirements of Key Agreement protocols, require a subset of operations with low complexity in compare with related protocols in this scientific area

TH-HPG: threshold based hello packet generation scheme for intra wireless body area networks

Sensor Nodes (SNs) in Wireless Body Area Network (WBAN) sense and forward data towards Body Network Coordinator (BNC). Sensed data in WBAN contains information related to human physiological signals and vital signs. Other than sensed data, control packets are also forwarded among Senosr Nodes (SNs) and commonly known as Hello packets which announce the status of SN to its Neighbor Nodes (NNs) in the network. Updated Hello packets are required to forward latest information about SNs in the network. However, reduced number of Hello packets is the necessity as control packets generate overhead traffic in the network. The proposed, Threshold based Hello Packet Generation (TH-HPG) scheme produces reduced number of Hello packets and announces the availability of SN with updated status information. Performance analysis of TH-HPG scheme with state-of-the-art schemes demonstrate the better performance in terms of energy consumption and number of control packets generated (control overhead)

A survey of TDMA-based MAC protocols for vehicular ad hoc networks

MAC design in a vehicle network is a challenging task due to high node speed, frequent topology changes, lack of infrastructure, and different QoS requirements. Several medium access control protocols based on Time Division Multiple Access (TDMA) have recently been suggested for VANETs in an effort to guarantee that all cars have sufficient time to send safety messages without collisions and to decrease the end-to-end delay and the loss ratio of packets. The reasons for using the collision-free media access control paradigm in VANETs are identified in this document. We then present a new topology-based classification and provide an overview of the MAC protocols suggested for VANETs based on TDMA. We concentrate on these protocols ' features as well as their advantages and constraints. Finally, we provide a qualitative comparison and address some open problems that need to be addressed in future studies to enhance the efficiency of TDMA-based MAC protocols for vehicle-to-vehicle (V2V) and vehicle to infrastructural (V2I) communications

An efficient pairing-free certificateless authenticated two-party key agreement protocol over elliptic curves

Due to the high computation cost of bilinear pairings, pairing-free cryptosystems have received widespread attention recently. Various pairing-free two-party key agreement protocols in the context of public key cryptography (PKC) have been studied. To avoid complex certificate management in traditional PKC and key escrow problem in identity-based ones, several certificateless cryptosystems have been proposed in this research area. In this paper, we proposed a secure and efficient certificateless pairing-free two-party key agreement protocol. In comparison with related works, our protocol requires less computational cost

New secure identity-based and certificateless authenticated Key Agreement protocols without pairings

Recently, various pairing-based and pairing-free two party Key Agreement protocols in the context of Identity-Based and Certificateless cryptosystems have been published. The pairing-free Key Agreement protocols could improve the efficiency by eliminating the high expense of pairing maps. In this paper, we proposed several secure and efficient Identity-Based and Certificateless pairing-free two party Key Agreement protocols. In compare with related works, our protocols require less computational cost

Rushing attack against routing protocols in Mobile Ad-Hoc Networks

Because of the nature of wireless channels, Mobile Ad-Hoc Networks (MANETs) are vulnerable against many threats and attacks. Beside of this, the mobility of the network nodes made the security of routing protocols one of the most interesting research areas over Ad-Hoc networks. Moreover, Rushing attack became one of the common attacks against routing protocols in MANETs. Although there are many researches over Rushing attacks, the security research community suffers from a famine of evidence to present the exact position of this kind of attacks in MANETs clearly. Therefore, we paid particular attention to this issue to clarify the position of Rushing attacks against routing protocols and the functionality of this category of attacks. We hope that our document be useful for other researchers in understanding mentioned issue in face with this class of attacks

A secure identity-based key agreement protocol without key-escrow

In the past decade, pairing-based schemes have been proposed extensively for the cryptographic primitives including key agreement. However, recently researchers have shown an increased interest in Pairing-Free cryptography because of high computational cost of Bilinear Pairings. In this study, we could propose a new two-party pairing-free identity-based authenticated key agreement protocol over elliptic curve based algebraic groups. We could show that beside of supporting security requirements of key agreement protocols, our proposed protocol could overcome to the inherent problem of identity-based cryptosystems named key escrow. In addition, performance of our proposed protocol is improved from complexity of computation perspective in compare with related works

Security evaluation over lightweight cryptographic protocols

Due to the applicability of a wide range of cryptosystems in recently proposed applications, a large variety of cryptographic schemes have been developed. It can be claimed that proposing a cryptographic protocol to satisfy security and efficiency requirements is one of the significant challenging issues. Nevertheless, cryptographic research community suffers from non-existence of an integrated pattern to categorize and standardize possible challenges of mentioned concerns. These drawbacks could in turn lead to much confusion for the researchers who are not expert in this research area. Therefore, we paid particular attention to assemble a powerful document to fill this gap between the beginners and the experts. Our final goal is to make other researchers able to classify the challenges over Provably Secure cryptosystems or lightweight ones, analyze the proposed scheme based on the determined components and help them to find better solutions for the future researches